Single -frequency approximation of the coupling ray theory Ludˇek Klimeˇs & Petr Bulant Department of Geophysics Faculty of Mathematics and Physics Charles University in Prague

Source URL: seis.karlov.mff.cuni.cz

Research topics (JuneLudˇek Klimeˇs 1. Interpolation of the single-frequency approximation of the couplingray-theory S-wave Green tensor within ray cells in anisotropic media. 2. Common-source Kirchhoff prestack

Source URL: seis.karlov.mff.cuni.cz

IEEE TRANSACTIONS ON INFORMAI10N THEORY, VOL. 39, NO.3, MAYUniversal Approximation Bounds for Superpositions of a Sigmoidal Function

Source URL: www.stat.yale.edu

CPS296.2 Geometric Optimization February 13, 2007 Lecture 9: Random sampling, -approximation and -nets Lecturer: Pankaj K. Agarwal

Source URL: www.cs.duke.edu

• Support
• Measure
• Spectral theory
• Normal distribution
• Orbifold
• Mathematical analysis
• Measure theory
• Mathematics

CME 305: Discrete Mathematics and Algorithms 1 Approximation Algorithms

Source URL: stanford.edu

• Operations research
• Computational complexity theory
• NP-complete problems
• Job shop scheduling
• Mathematical optimization
• Approximation algorithm
• Linear programming
• Algorithm
• Vertex cover
• Theoretical computer science
• Applied mathematics
• Mathematics

SBAM: An Algorithm for Pair Matching Peter Stephensen February 2012

Source URL: www.dreammodel.dk

• Operations research
• Multivariate statistics
• Matrix
• Sparse matrix
• Mathematical optimization
• Matrix theory
• Sparse approximation
• Linear programming
• Algebra
• Mathematics
• Linear algebra

An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour∗ ‡ Michel X. Goemans†

Source URL: www.stanford.edu

• Spanning tree
• Loop-erased random walk
• Minimum spanning tree
• Chernoff bound
• Eulerian path
• NP-complete problems
• Dominating set
• Tutte polynomial
• Graph theory
• Mathematics
• Theoretical computer science

Physics 492: Quantum Mechanics II Problem Set #9 Due: Thursday, April 22, 2004 Problem 1: Lennard-Jones Encore (15 points) In Problem Set #2 we studied the validity of the harmonic approximation to various

Source URL: info.phys.unm.edu

• Abstract algebra
• Mathematical physics
• Ordinary differential equations
• Matrix theory
• Eigenvalues and eigenvectors
• Vector space
• Perturbation theory
• Algebra
• Mathematics
• Linear algebra

Algorithms, Spring 2014, CSE, OSU Greedy algorithms II Instructor: Anastasios Sidiropoulos Greedy algorithms

Source URL: web.cse.ohio-state.edu

• Greedy algorithm
• Matroid theory
• Mathematical optimization
• Algorithm
• Approximation algorithm
• Function
• Optimization problem
• Golden ratio base
• Activity selection problem
• Mathematics
• Applied mathematics
• Operations research

A SELECTION THEORY FOR MULTIPLE-VALUED FUNCTIONS IN THE SENSE OF ALMGREN JORDAN GOBLET Abstract. A Qk (Rn )-valued function is essentially a rule assigning k unordered and non necessarily distinct elements of Rn to each

Source URL: www.uclouvain.be

• Calculus
• Approximation theory
• Mathematical constructivism
• Modulus of continuity
• Continuous function
• Arzelà–Ascoli theorem
• Mathematical analysis
• Mathematics
• Fourier analysis